منابع مشابه
Conditional Degree of Belief
The normative force of Bayesian inference is based on the existence of a uniquely rational degree of belief in evidence E given a hypothesis H, that is, p(E|H). To motivate this claim, think of what a Bayesian inference in science typically looks like. There is a competing set of hypotheses that correspond to different values of an unknown parameter, such as the chance θ ∈ [0, 1] of a coin to c...
متن کاملIndeterminacy, Degree of Belief, and Excluded Middle
1. Referential indeterminacy (for instance, indeterminacy as to what a singular term stands for or what a general term has as its extension) is a widespread phenomenon. Ordinary vagueness is a special case of indeterminacy: for instance, it is indeterminate whether the word ‘rich’ has in its extension certain moderately rich people, and it is indeterminate precisely which atoms are parts of the...
متن کاملOn The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کاملAnalyzing the degree of conflict among belief functions
The study of alternative combination rules in DS theory when evidence is in conflict has emerged again recently as an interesting topic, especially in data/information fusion applications. These studies have mainly focused on investigating which alternative would be appropriate for which conflicting situation, under the assumption that a conflict is identified. The issue of detection (or identi...
متن کاملEfficient Computation of the Degree of Belief for a Subclass of Two Conjuctive Forms
Assuming a Knowledge Base Σ expressed by a two Conjunctive Form (2-CF), we show that if the constrained graph of Σ is acyclic or if its cyles are independent one to the other, then it is possible to count efficiently the number of models of Σ. We determine a set of recurrence equations which allow us to design an incremental technique for counting models by a simple traversal of the constrained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1973
ISSN: 0028-0836,1476-4687
DOI: 10.1038/242483b0